A Survey of Primary Decomposition using GrSbner Bases
نویسندگان
چکیده
A Survey of Primary Decomposition using GrSbner Bases MICHELLE WILSON Submitted to the Department of Mathematics in partial fulfillment of the requirements for the degree of Master of Science We present a survey of primary decomposition of ideals in a noetherian commutative polynomial ring R[x] = R[xi,..., x,]. With the use of ideal operations introduced and the lexicographical Gr6bner bases of ideals in R[x], we show that it is possible to compute a primary decomposition of these ideals. Our method involves the reduction of the general primary decomposition problem to the case of zero-dimensional ideals. Furthermore, we solve the general primary decomposition problem when the coefficient ring is a principal ideal domain. For the zero-dimensional ideals in R[x], we compute inductively their irredundant primary decomposition. In addition, we show that we can compute primary decomposition of zero-dimensional ideals over a field of characteristic zero. We do this by considering ideals in "general position". Finally, we present algorithms to perform the computation of primary decomposition in the cases discussed. Thesis Advisor: Dr. Steven Kleiman Title: Professor of Pure Mathematics
منابع مشابه
Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases
In this paper, it is proved that any algehraicgeometr ic code can be expressed as a cross section of an extended multidimensional cyclic code. Both algebraic-geometric codes and multidimensional cyclic codes are descr ibed by a unified theory of l inear block codes def ined over point sets: algebraic-geometric codes are def ined over the points of an algebraic curve, and an m-dimensional cyclic...
متن کاملPrimary Decomposition of Modules over Dedekind Domains Using Gröbner Bases
In [6] was proved that if R is a principal ideal domain and N ⊂ M are submodules of R[x1, . . . , xn], then the primary decomposition for N in M can be computed using Gröbner bases. In this paper we extend this result to Dedekind domains. The procedure that computed the primary decomposition is illustrated with an example.
متن کاملQuasi-Primary Decomposition in Modules Over Proufer Domains
In this paper we investigate decompositions of submodules in modules over a Proufer domain into intersections of quasi-primary and classical quasi-primary submodules. In particular, existence and uniqueness of quasi-primary decompositions in modules over a Proufer domain of finite character are proved. Proufer domain; primary submodule; quasi-primary submodule; classical quasi-primary; decompo...
متن کاملClassical quasi-primary submodules
In this paper we introduce the notion of classical quasi-primary submodules that generalizes the concept of classical primary submodules. Then, we investigate decomposition and minimal decomposition into classical quasi-primary submodules. In particular, existence and uniqueness of classical quasi-primary decompositions in finitely generated modules over Noetherian rings are proved. More...
متن کاملNew Bases for Polynomial-Based Spaces
Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...
متن کامل